- theory of machines
- teoria mechanizmów i maszyn
English-Polish dictionary for engineers. 2013.
theory of machines
Look at other dictionaries:
theory — noun ADJECTIVE ▪ complete, unified ▪ a grand unified theory of the physical forces governing matter ▪ general ▪ coherent ▪ current … Collocations dictionary
Theory-based semantics — is a phrase used by Richard L. Ballard to describe knowledge representations that are based on the premise that the binding element of human thought is theory, and that theory constrains the meaning of concepts, ideas and thought patterns… … Wikipedia
Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia
Theory of equations — Equation E*qua tion, n. [L. aequatio an equalizing: cf. F. [ e]quation equation. See {Equate}.] 1. A making equal; equal division; equality; equilibrium. [1913 Webster] Again the golden day resumed its right, And ruled in just equation with the… … The Collaborative International Dictionary of English
Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and … Wikipedia
in theory — adverb with regard to fundamentals although not concerning details in principle, we agree • Syn: ↑in principle, ↑in essence * * * IN PRINCIPLE, on paper, in the abstract, all things being equal, in an ideal world; hypothetically. → theory * * *… … Useful english dictionary
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
